2.1 Time-bounded Classes
نویسندگان
چکیده
In the previous lecture, there was a question about whether or not true randomness exists in the universe. This question is still seriously debated by many physicists and philosophers. However, even if true randomness does not exist, it is possible to use pseudorandomness for practical purposes. In any case, randomization is a powerful tool in algorithms design, sometimes leading to more elegant or faster ways of solving problems than known deterministic methods.
منابع مشابه
Structural Properties and Constant Factor-Approximation of Strong Distance-r Dominating Sets in Sparse Directed Graphs
Bounded expansion and nowhere dense graph classes, introduced by Nešetřil and Ossona de Mendez [26, 27], form a large variety of classes of uniformly sparse graphs which includes the class of planar graphs, actually all classes with excluded minors, and also bounded degree graphs. Since their initial definition it was shown that these graph classes can be defined in many equivalent ways: by gen...
متن کاملp-Lambda-bounded variation
A characteriation of continuity of the $p$-$Lambda$-variation function is given and the Helly's selection principle for $Lambda BV^{(p)}$ functions is established. A characterization of the inclusion of Waterman-Shiba classes into classes of functions with given integral modulus of continuity is given. A useful estimate on modulus of variation of functions of class $Lambda BV^{(p)}$ is found.
متن کاملModel Counting for Formulas of Bounded Clique-Width
We show that #SAT is polynomial-time tractable for classes of CNF formulas whose incidence graphs have bounded symmetric clique-width (or bounded clique-width, or bounded rank-width). This result strictly generalizes polynomial-time tractability results for classes of formulas with signed incidence graphs of bounded clique-width and classes of formulas with incidence graphs of bounded modular t...
متن کاملStability of essential spectra of bounded linear operators
In this paper, we show the stability of Gustafson, Weidmann, Kato, Wolf, Schechter and Browder essential spectrum of bounded linear operators on Banach spaces which remain invariant under additive perturbations belonging to a broad classes of operators $U$ such $gamma(U^m)
متن کاملThe Generalised Colouring Numbers on Classes of Bounded Expansion
The generalised colouring numbers admr(G), colr(G), and wcolr(G) were introduced by Kierstead and Yang as generalisations of the usual colouring number, also known as the degeneracy of a graph, and have since then found important applications in the theory of bounded expansion and nowhere dense classes of graphs, introduced by Nešetřil and Ossona de Mendez. In this paper, we study the relation ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012